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 1, 2026 21:03Josu San MartinJosu San MartinScore: 6,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:036,18373,864,89549,309,0002,012,0002,322,432
2Jan 1, 2026 21:036,20674,917,97148,478,0003,029,0002,449,408
3Jan 1, 2026 21:036,30580,623,95047,298,0005,031,0002,330,624
4Jan 1, 2026 21:036,49577,566,50250,915,0002,995,0002,510,848
5Jan 1, 2026 21:036,53475,480,94353,228,0001,004,0002,347,008
6Jan 1, 2026 21:036,56675,790,01852,480,0002,018,0002,420,736