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 04:23wnwnScore: 3,727Success
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 04:273,47939,416,59427,871,0001,012,00020,480
2Sep 24, 2026 04:273,52038,009,68328,009,0001,213,0002,113,536
3Sep 24, 2026 04:273,66639,251,15928,889,0001,542,0002,113,536
4Sep 24, 2026 04:273,72740,330,03329,876,0001,060,00020,480
5Sep 24, 2026 04:273,72744,501,95329,423,0001,517,00020,480
6Sep 24, 2026 04:273,75640,182,31529,642,0001,538,0002,113,536
7Sep 24, 2026 04:273,77940,795,79129,618,0001,753,0002,113,536
8Sep 24, 2026 04:273,77940,122,71929,664,0001,704,0002,113,536
9Sep 24, 2026 04:274,35645,580,92529,521,0006,642,0002,113,536