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 8, 2026 20:10wnwnScore: 4,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 20:114,44657,721,99734,908,0001,994,0002,490,368
2Mar 8, 2026 20:114,44856,845,72734,921,0001,995,0002,498,560
3Mar 8, 2026 20:104,45960,598,43235,008,0002,000,0002,482,176
4Mar 8, 2026 20:114,46366,441,04535,040,0002,002,0002,494,464
5Mar 8, 2026 20:104,46860,844,87235,078,0002,004,0002,273,280
6Mar 8, 2026 20:104,47765,783,11835,153,0002,008,0002,265,088
7Mar 8, 2026 20:104,58868,060,17136,076,0002,004,0002,498,560
8Mar 8, 2026 20:104,69769,181,17936,985,0001,999,0002,490,368
9Mar 8, 2026 20:1010,727115,453,66787,031,0002,000,0002,490,368