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 listSep 17, 2026 00:16Andrew EpsteinAndrew EpsteinScore: 4,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:164,02943,837,71632,308,0001,138,0002,113,536
2Sep 17, 2026 00:164,02943,814,91732,300,0001,148,0002,113,536
3Sep 17, 2026 00:164,15045,564,94033,301,0001,148,0002,113,536
4Sep 17, 2026 00:164,17345,757,28233,491,0001,146,0002,113,536
5Sep 17, 2026 00:164,18245,748,41833,546,0001,170,0002,117,632
6Sep 17, 2026 00:164,19046,907,69633,627,0001,155,0002,113,536
7Sep 17, 2026 00:164,20245,914,29133,740,0001,141,0002,113,536
8Sep 17, 2026 00:164,26845,888,39434,398,0001,027,0002,113,536
9Sep 17, 2026 00:164,37646,733,54435,181,0001,141,0002,113,536