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 listJul 17, 2026 03:30Kevin HeaveyKevin HeaveyScore: 3,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 03:353,69940,436,66929,496,0001,213,0002,117,632
2Jul 17, 2026 03:353,70640,549,59929,470,0001,291,0002,117,632
3Jul 17, 2026 03:353,70740,568,17929,556,0001,218,0002,117,632
4Jul 17, 2026 03:353,72340,710,69829,645,0001,264,0002,117,632
5Jul 17, 2026 03:353,72640,706,65229,902,0001,024,0002,117,632
6Jul 17, 2026 03:353,76741,038,04130,038,0001,230,0002,117,632
7Jul 17, 2026 03:353,78041,018,27130,342,0001,040,0002,117,632
8Jul 17, 2026 03:353,78341,159,09230,366,0001,037,0002,117,632
9Jul 17, 2026 03:353,78841,170,40330,405,0001,038,0002,117,632