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 listAug 1, 2026 20:36TonyTonyScore: 41,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 20:3641,767354,944,193345,663,0001,004,0002,117,632
2Aug 1, 2026 20:3641,820356,493,090346,111,0001,003,0002,117,632
3Aug 1, 2026 20:3641,834355,660,994346,226,0001,004,0002,117,632
4Aug 1, 2026 20:3641,840355,597,831346,270,0001,004,0002,117,632
5Aug 1, 2026 20:3641,843355,735,234346,299,0001,004,0002,117,632
6Aug 1, 2026 20:3641,865355,795,808346,472,0001,014,0002,117,632
7Aug 1, 2026 20:3641,865356,663,576346,484,0001,003,0002,117,632
8Aug 1, 2026 20:3641,873355,839,268346,545,0001,004,0002,117,632
9Aug 1, 2026 20:3641,890356,957,166346,685,0001,004,0002,117,632