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 2, 2026 20:57leoweleoweScore: 59,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 20:5759,722520,913,152493,692,0001,998,0002,277,376
2Apr 2, 2026 20:5759,752518,832,270492,939,0002,999,0002,277,376
3Apr 2, 2026 20:5759,755519,839,850493,964,0001,999,0002,277,376