Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 1, 2023 22:30Ignas BagdonasIgnas BagdonasScore: 17,812Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2023 22:3017,766174,130,534146,454,0001,003,0002,269,184
2Sep 1, 2023 22:3017,780176,445,953146,572,0001,003,0002,273,280
3Sep 1, 2023 22:3017,782172,729,473146,589,0001,004,0002,273,280
4Sep 1, 2023 22:3017,784176,404,431145,600,0002,008,0002,273,280
5Sep 1, 2023 22:3017,803175,831,474145,770,0001,996,0002,273,280
6Sep 1, 2023 22:3017,808175,437,414144,813,0002,996,0002,265,088
7Sep 1, 2023 22:3017,812174,621,848146,842,000998,0002,531,328
8Sep 1, 2023 22:3017,983171,536,555147,252,0002,003,0002,392,064
9Sep 1, 2023 22:3017,990171,609,251148,316,0001,002,0002,273,280
10Sep 1, 2023 22:3018,496217,722,845153,518,41202,293,760
11Sep 1, 2023 22:3018,563223,627,396154,072,42902,293,760
12Sep 1, 2023 22:3018,578218,519,321154,194,19902,281,472