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 listAug 11, 2026 13:57Victor MerckléVictor MerckléScore: 3,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 13:583,91940,899,42031,508,0001,023,0002,117,632stderr
2Aug 11, 2026 13:583,92441,041,87331,485,0001,089,0002,117,632stderr
3Aug 11, 2026 13:583,93440,977,85431,579,0001,078,0002,117,632stderr
4Aug 11, 2026 13:583,95841,299,71331,726,0001,128,0002,117,632stderr
5Aug 11, 2026 13:583,96641,261,67831,881,0001,045,0002,117,632stderr
6Aug 11, 2026 13:584,01041,645,69832,257,0001,029,0002,117,632stderr
7Aug 11, 2026 13:584,01141,712,99732,238,0001,057,0002,117,632stderr
8Aug 11, 2026 13:584,04341,983,38932,445,0001,116,0002,117,632stderr
9Aug 11, 2026 13:584,11542,530,76333,139,0001,022,0002,117,632stderr