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 listApr 13, 2026 11:29Oleg SkinderevOleg SkinderevScore: 65,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:2965,160569,378,724536,827,0003,998,0002,277,376
2Apr 13, 2026 11:2965,167567,775,225539,891,000999,0002,277,376
3Apr 13, 2026 11:2965,178565,550,106538,980,0001,999,0002,519,040
4Apr 13, 2026 11:2965,191564,014,559540,087,0001,000,0002,281,472
5Apr 13, 2026 11:2965,203566,795,446539,188,0002,000,0002,277,376
6Apr 13, 2026 11:2965,218562,401,182541,307,00002,273,280
7Apr 13, 2026 11:2965,233571,203,520540,430,0001,000,0002,277,376
8Apr 13, 2026 11:2965,236567,183,632541,462,00002,269,184
9Apr 13, 2026 11:2965,290572,304,179539,909,0001,999,0002,277,376