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 14, 2026 00:44Victor MerckléVictor MerckléScore: 7,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:447,50970,655,17562,332,00002,113,536
2May 14, 2026 00:447,51972,508,61861,386,0001,028,0002,113,536
3May 14, 2026 00:447,52171,335,96861,413,0001,016,0002,113,536
4May 14, 2026 00:447,52269,685,04261,406,0001,033,0002,113,536
5May 14, 2026 00:447,52372,574,42961,425,0001,023,0002,113,536
6May 14, 2026 00:447,54373,426,14061,497,0001,117,0002,113,536
7May 14, 2026 00:447,56171,337,88261,720,0001,041,0002,113,536
8May 14, 2026 00:447,56772,001,53961,798,0001,010,0002,113,536
9May 14, 2026 00:447,58272,446,65061,893,0001,041,0002,113,536