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 3, 2026 20:49TudyMTudyMScore: 34,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:5334,977304,758,097289,304,0001,006,0002,383,872
2May 3, 2026 20:5334,980309,377,706289,333,0001,005,0002,392,064
3May 3, 2026 20:5334,985306,706,803289,374,0001,005,0002,375,680
4May 3, 2026 20:5334,986307,205,263289,386,0001,004,0002,379,776
5May 3, 2026 20:5334,992308,202,873289,436,0001,005,0002,387,968
6May 3, 2026 20:5334,995308,851,015289,458,0001,005,0002,375,680
7May 3, 2026 20:5335,000308,938,776289,500,0001,005,0002,371,584
8May 3, 2026 20:5335,002307,356,846289,515,0001,006,0002,371,584
9May 3, 2026 20:5335,087311,622,284290,221,0001,006,0002,383,872