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 5, 2026 14:53Kevin HeaveyKevin HeaveyScore: 9,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:549,17185,607,52674,948,0001,174,0002,117,632
2Jul 5, 2026 14:549,18785,801,79174,997,0001,258,0002,117,632
3Jul 5, 2026 14:549,27886,569,31275,847,0001,164,0002,117,632
4Jul 5, 2026 14:549,27986,563,42175,837,0001,183,0002,117,632
5Jul 5, 2026 14:549,28586,708,02975,895,0001,172,0002,117,632
6Jul 5, 2026 14:549,29086,594,44175,945,0001,169,0002,117,632
7Jul 5, 2026 14:549,31386,816,91676,078,0001,223,0002,117,632
8Jul 5, 2026 14:549,32086,858,68976,341,0001,017,0002,117,632
9Jul 5, 2026 14:549,40987,664,41276,942,0001,155,0002,117,632