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 2, 2026 06:37Josu San MartinJosu San MartinScore: 6,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 06:376,39084,278,35050,039,0003,002,0002,367,488
2Jan 2, 2026 06:376,41185,023,66149,194,0004,015,0002,387,968
3Jan 2, 2026 06:376,41779,380,96251,253,0002,009,0002,445,312
4Jan 2, 2026 06:376,74685,150,30653,989,0001,999,0002,363,392
5Jan 2, 2026 06:376,77486,410,31450,203,0006,024,0002,498,560
6Jan 2, 2026 06:376,80381,377,18754,451,0002,016,0002,490,368