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 7, 2026 19:23Kevin HeaveyKevin HeaveyScore: 4,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:243,82341,301,38430,574,0001,158,0002,117,632
2Jul 7, 2026 19:243,88641,792,58731,068,0001,189,0002,117,632
3Jul 7, 2026 19:243,89741,859,93431,193,0001,153,0002,117,632
4Jul 7, 2026 19:243,92143,484,58931,385,0001,164,0002,117,632
5Jul 7, 2026 19:244,10543,636,19733,054,0001,018,0002,117,632
6Jul 7, 2026 19:244,24344,807,84934,054,0001,170,0002,117,632
7Jul 7, 2026 19:244,24444,740,43534,075,0001,156,0002,117,632
8Jul 7, 2026 19:244,30545,283,04634,543,0001,196,0002,117,632
9Jul 7, 2026 19:244,36445,839,31235,194,0001,028,0002,117,632