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 27, 2025 20:40Josu San MartinJosu San MartinScore: 33,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 20:3933,314303,102,647275,502,0001,001,0002,277,376
2Dec 27, 2025 20:4033,332302,327,526275,658,000998,0002,293,760
3Dec 27, 2025 20:3933,362299,679,144274,907,0001,999,0002,277,376
4Dec 27, 2025 20:3933,379300,372,427276,042,0001,000,0002,273,280
5Dec 27, 2025 20:4033,435302,429,524276,511,0001,001,0002,293,760
6Dec 27, 2025 20:4033,462304,580,302275,740,0001,998,0002,265,088