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 12, 2026 14:47Kevin HeaveyKevin HeaveyScore: 4,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 14:484,77149,228,90838,404,0001,199,0002,117,632
2Jul 12, 2026 14:484,77549,223,28438,351,0001,286,0002,117,632
3Jul 12, 2026 14:484,80349,518,11238,842,0001,024,0002,117,632
4Jul 12, 2026 14:484,80649,526,54338,704,0001,189,0002,117,632
5Jul 12, 2026 14:484,82449,715,70038,763,0001,280,0002,117,632
6Jul 12, 2026 14:485,97659,272,86048,591,0001,017,0002,117,632
7Jul 12, 2026 14:486,00460,959,13148,613,0001,224,0002,117,632
8Jul 12, 2026 14:486,05960,014,01649,264,0001,031,0002,117,632
9Jul 12, 2026 14:486,07560,743,84549,408,0001,016,0002,117,632