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 15:38Victor MerckléVictor MerckléScore: 7,888Success
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 15:397,87872,946,64565,395,00002,113,536
2May 13, 2026 15:397,87972,726,18664,391,0001,009,0002,113,536
3May 13, 2026 15:397,88773,386,53265,466,00002,113,536
4May 13, 2026 15:397,88773,622,58064,461,0001,004,0002,113,536
5May 13, 2026 15:397,88874,837,71164,438,0001,040,0002,113,536
6May 13, 2026 15:397,89072,793,02764,475,0001,019,0002,113,536
7May 13, 2026 15:397,89372,777,44364,510,0001,008,0002,113,536
8May 13, 2026 15:397,89474,032,46064,496,0001,029,0002,113,536
9May 13, 2026 15:397,90075,010,92964,572,0001,005,0002,113,536