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 listDec 23, 2025 14:58Josu San MartinJosu San MartinScore: 34,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 14:5834,257306,848,002283,334,0001,001,0002,289,664
2Dec 23, 2025 14:5834,294312,540,727282,643,0001,997,0002,289,664
3Dec 23, 2025 14:5834,303307,805,881282,715,0001,997,0002,289,664
4Dec 23, 2025 14:5834,305317,467,454282,732,0001,998,0002,289,664
5Dec 23, 2025 14:5834,309306,452,271282,770,0001,998,0002,273,280
6Dec 23, 2025 14:5834,310307,045,658282,771,0001,998,0002,289,664
7Dec 23, 2025 14:5834,311308,082,198282,787,0001,998,0002,371,584
8Dec 23, 2025 14:5834,313313,213,826282,802,0001,998,0002,265,088
9Dec 23, 2025 14:5834,317308,793,814282,832,0001,998,0002,289,664