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 21, 2026 22:00M-RochatM-RochatScore: 6,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 22:006,57964,500,38452,552,0002,061,0002,113,536
2May 21, 2026 22:006,59165,395,10052,641,0002,067,0002,113,536
3May 21, 2026 22:006,59467,129,11552,692,0002,045,0002,113,536
4May 21, 2026 22:006,59564,485,78052,679,0002,065,0002,113,536
5May 21, 2026 22:006,60264,980,73852,741,0002,062,0002,113,536
6May 21, 2026 22:006,60764,821,67452,766,0002,075,0002,113,536
7May 21, 2026 22:006,61164,683,01152,714,0002,163,0002,113,536
8May 21, 2026 22:006,61566,482,46552,867,0002,044,0002,113,536
9May 21, 2026 22:006,72568,205,20553,618,0002,200,0002,113,536