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 19:53leoweleoweScore: 96,028Success
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 19:5395,869822,847,075731,734,00063,976,0002,519,040
2Apr 2, 2026 19:5396,028823,826,582734,034,00063,002,0002,289,664
3Apr 2, 2026 19:5396,034819,134,560733,077,00064,006,0002,281,472