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 12:49Kevin HeaveyKevin HeaveyScore: 20,260Success
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 12:4920,240177,514,141166,874,0001,125,0002,117,632
2Jul 5, 2026 12:4920,253177,666,588166,959,0001,145,0002,117,632
3Jul 5, 2026 12:4920,257177,739,991166,917,0001,218,0002,117,632
4Jul 5, 2026 12:4920,258178,124,496166,995,0001,153,0002,117,632
5Jul 5, 2026 12:4920,260177,895,994167,014,0001,149,0002,117,632
6Jul 5, 2026 12:4920,260177,733,261166,994,0001,167,0002,117,632
7Jul 5, 2026 12:4920,269177,798,656167,064,0001,173,0002,121,728
8Jul 5, 2026 12:4920,269177,908,422167,068,0001,172,0002,117,632
9Jul 5, 2026 12:4920,275177,856,346167,279,0001,005,0002,117,632