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 listApr 3, 2026 12:47zielajzielajScore: 3,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 12:473,47453,750,08327,841,000994,0002,424,832
2Apr 3, 2026 12:473,56752,046,81728,585,0001,020,0002,437,120
3Apr 3, 2026 12:473,65951,496,71729,356,0001,012,0002,428,928