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:43Kevin HeaveyKevin HeaveyScore: 13,163Success
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:4413,148118,631,223107,971,0001,160,0002,117,632
2Jul 5, 2026 14:4413,152118,734,061107,974,0001,192,0002,117,632
3Jul 5, 2026 14:4413,152118,688,435107,944,0001,219,0002,117,632
4Jul 5, 2026 14:4413,154118,762,398108,010,0001,169,0002,117,632
5Jul 5, 2026 14:4413,163118,738,335108,071,0001,188,0002,117,632
6Jul 5, 2026 14:4413,169118,915,529108,068,0001,237,0002,117,632
7Jul 5, 2026 14:4413,182119,009,208108,406,0001,006,0002,117,632
8Jul 5, 2026 14:4413,188119,012,709108,461,0001,007,0002,117,632
9Jul 5, 2026 14:4413,396120,818,642109,983,0001,212,0002,117,632