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 19, 2026 00:55Maya RebholzMaya RebholzScore: 91,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 00:5590,894765,608,918697,364,00057,060,0002,113,536
2May 19, 2026 00:5590,977766,006,907697,376,00057,734,0002,113,536
3May 19, 2026 00:5590,988766,836,434697,389,00057,817,0002,113,536
4May 19, 2026 00:5591,021767,622,826697,346,00058,131,0002,113,536
5May 19, 2026 00:5591,062765,726,020697,338,00058,478,0002,113,536
6May 19, 2026 00:5591,116767,496,848698,964,00057,304,0002,113,536
7May 19, 2026 00:5591,225767,466,560699,008,00058,166,0002,113,536
8May 19, 2026 00:5591,235767,079,616699,142,00058,116,0002,113,536
9May 19, 2026 00:5591,250770,572,783699,079,00058,301,0002,113,536