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 15, 2026 02:01Kevin HeaveyKevin HeaveyScore: 3,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 02:023,68540,243,23829,561,0001,027,0002,117,632
2Jul 15, 2026 02:023,68940,274,31129,601,0001,024,0002,117,632
3Jul 15, 2026 02:023,70040,405,33429,685,0001,026,0002,117,632
4Jul 15, 2026 02:023,70140,344,28129,699,0001,021,0002,117,632
5Jul 15, 2026 02:023,70640,351,39129,732,0001,028,0002,117,632
6Jul 15, 2026 02:023,76740,959,74730,233,0001,041,0002,117,632
7Jul 15, 2026 02:023,78141,013,66530,344,0001,045,0002,117,632
8Jul 15, 2026 02:023,79741,194,68830,474,0001,049,0002,117,632
9Jul 15, 2026 02:023,80042,581,12030,498,0001,049,0002,117,632