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 31, 2026 18:00olliecrowolliecrowScore: 6,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 18:006,65581,525,46251,217,0004,017,0002,449,408
2Jan 31, 2026 18:006,66083,144,42652,260,0003,015,0002,301,952
3Jan 31, 2026 18:006,82087,195,38254,589,0002,021,0002,367,488
4Jan 31, 2026 18:006,94282,911,70554,589,0003,032,0002,273,280
5Jan 31, 2026 18:006,97786,327,68754,918,0002,995,0002,400,256
6Jan 31, 2026 18:007,06383,855,57856,600,0002,021,0002,285,568