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 13, 2026 12:26Victor MerckléVictor MerckléScore: 7,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 12:267,91775,083,78064,702,0001,015,0002,113,536
2May 13, 2026 12:267,92075,790,12464,726,0001,012,0002,113,536
3May 13, 2026 12:267,92374,181,28664,741,0001,021,0002,113,536
4May 13, 2026 12:267,92474,797,06964,737,0001,033,0002,113,536
5May 13, 2026 12:267,92673,455,34464,744,0001,045,0002,113,536
6May 13, 2026 12:267,92676,151,09164,740,0001,046,0002,113,536
7May 13, 2026 12:267,92776,268,93964,775,0001,021,0002,113,536
8May 13, 2026 12:267,92878,219,98864,779,0001,024,0002,113,536
9May 13, 2026 12:267,93076,015,86664,793,0001,033,0002,113,536