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 listMar 29, 2026 21:10Danylo MocherniukDanylo MocherniukScore: 6,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:106,64783,900,21253,162,0002,006,0002,293,760
2Mar 29, 2026 21:106,66782,743,03253,324,0002,012,0002,506,752
3Mar 29, 2026 21:106,66877,304,16953,333,0002,012,0002,293,760
4Mar 29, 2026 21:106,67078,410,93853,346,0002,013,0002,506,752
5Mar 29, 2026 21:106,67080,152,94654,354,0001,006,0002,293,760
6Mar 29, 2026 21:106,67077,820,10953,349,0002,013,0002,293,760
7Mar 29, 2026 21:106,68677,505,97855,493,00002,293,760
8Mar 29, 2026 21:106,70880,268,30154,664,0001,012,0002,506,752
9Mar 29, 2026 21:106,73477,409,76253,899,0001,996,0002,293,760