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 listJan 3, 2026 02:05Josu San MartinJosu San MartinScore: 6,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:055,94272,261,66649,316,00002,400,256
2Jan 3, 2026 02:055,96577,638,06949,513,00002,277,376
3Jan 3, 2026 02:056,01875,418,03747,955,0001,998,0002,400,256
4Jan 3, 2026 02:056,09374,291,72849,559,0001,011,0002,506,752
5Jan 3, 2026 02:056,24380,703,82549,826,0001,993,0002,400,256
6Jan 3, 2026 02:056,25173,630,42850,889,000997,0002,392,064
7Jan 3, 2026 02:056,26973,930,85651,033,0001,000,0002,404,352
8Jan 3, 2026 02:056,30781,831,67251,344,0001,006,0002,265,088
9Jan 3, 2026 02:056,31774,226,46551,421,0001,008,0002,510,848
10Jan 3, 2026 02:056,34277,973,03352,637,00002,514,944
11Jan 3, 2026 02:056,36878,335,90650,857,0001,994,0002,277,376
12Jan 3, 2026 02:056,45384,013,27153,556,00002,383,872