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 24, 2026 03:47wnwnScore: 3,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:483,52338,002,91727,820,0001,429,00020,480
2Sep 24, 2026 03:483,55738,338,86927,978,0001,549,00020,480
3Sep 24, 2026 03:483,59339,180,79529,826,000020,480
4Sep 24, 2026 03:483,66239,850,81030,396,000020,480
5Sep 24, 2026 03:483,74342,502,69829,638,0001,433,00020,480
6Sep 24, 2026 03:483,75140,579,30629,622,0001,519,00020,480
7Sep 24, 2026 03:483,77340,129,55629,789,0001,533,00020,480
8Sep 24, 2026 03:483,77740,822,89329,826,0001,524,00020,480
9Sep 24, 2026 03:484,00242,009,23628,986,0004,235,00020,480