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 listMar 25, 2026 17:27Ignas BagdonasIgnas BagdonasScore: 10,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 17:2710,170110,184,78683,405,0001,004,0002,293,760
2Mar 25, 2026 17:2710,174108,823,89184,448,00002,265,088
3Mar 25, 2026 17:2710,180107,076,01583,485,0001,005,0002,273,280
4Mar 25, 2026 17:2710,181106,901,73084,505,00002,375,680
5Mar 25, 2026 17:2710,183110,955,24583,514,0001,006,0002,293,760
6Mar 25, 2026 17:2710,186111,431,42883,535,0001,006,0002,293,760
7Mar 25, 2026 17:2710,186112,834,63284,542,00002,293,760
8Mar 25, 2026 17:2710,190113,947,31184,573,00002,277,376
9Mar 25, 2026 17:2710,191113,512,83783,580,0001,006,0002,293,760