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:14Victor MerckléVictor MerckléScore: 8,027Success
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:148,02076,786,89065,469,0001,099,0002,113,536
2May 13, 2026 12:148,02075,691,40565,453,0001,117,0002,113,536
3May 13, 2026 12:148,02173,962,23765,471,0001,106,0002,113,536
4May 13, 2026 12:148,02373,947,78665,485,0001,111,0002,113,536
5May 13, 2026 12:148,02775,819,80665,518,0001,109,0002,113,536
6May 13, 2026 12:148,02776,783,44965,499,0001,132,0002,113,536
7May 13, 2026 12:148,03075,828,67865,533,0001,120,0002,113,536
8May 13, 2026 12:148,03574,440,90065,577,0001,117,0002,113,536
9May 13, 2026 12:148,25778,777,50567,416,0001,121,0002,113,536