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 listJul 7, 2026 04:03wnwnScore: 3,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:043,29835,187,88726,358,0001,017,0002,113,536
2Jul 7, 2026 04:043,30135,394,46526,380,0001,024,0002,113,536
3Jul 7, 2026 04:043,30435,446,12126,405,0001,020,0002,113,536
4Jul 7, 2026 04:043,33235,468,86726,636,0001,023,0002,113,536
5Jul 7, 2026 04:043,33335,445,20326,625,0001,040,0002,113,536
6Jul 7, 2026 04:043,33635,572,78826,663,0001,034,0002,113,536
7Jul 7, 2026 04:043,48436,741,64827,903,0001,017,0002,113,536
8Jul 7, 2026 04:043,49236,808,10327,965,0001,025,0002,113,536
9Jul 7, 2026 04:043,50437,688,19028,068,0001,023,0002,113,536