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 listMay 12, 2026 03:11cashkarucashkaruScore: 39,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:1238,854331,260,703321,489,0001,003,0002,113,536
2May 12, 2026 03:1238,923333,627,029322,063,0001,004,0002,113,536
3May 12, 2026 03:1239,396336,584,071325,991,0001,003,0002,113,536
4May 12, 2026 03:1239,396338,927,210325,987,0001,004,0002,113,536
5May 12, 2026 03:1239,403337,707,606326,048,0001,002,0002,113,536
6May 12, 2026 03:1239,411337,527,155326,109,0001,003,0002,113,536
7May 12, 2026 03:1239,414338,025,460326,140,0001,004,0002,113,536
8May 12, 2026 03:1239,415336,521,491326,141,0001,004,0002,113,536
9May 12, 2026 03:1239,421336,659,035326,200,0001,002,0002,113,536