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 21, 2026 21:15Kevin HeaveyKevin HeaveyScore: 4,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 21:164,22844,755,72031,077,0004,020,0002,125,824
2Jul 21, 2026 21:164,25544,994,94532,196,0003,128,0002,125,824
3Jul 21, 2026 21:164,25645,081,79732,090,0003,241,0002,125,824
4Jul 21, 2026 21:164,39646,171,15932,375,0004,115,0002,125,824
5Jul 21, 2026 21:164,43146,722,75333,652,0003,129,0002,121,728
6Jul 21, 2026 21:164,52847,270,00233,504,0004,079,0002,125,824
7Jul 21, 2026 21:164,53447,880,14733,509,0004,131,0002,125,824
8Jul 21, 2026 21:1669,928590,159,416577,391,0003,012,0002,125,824
9Jul 21, 2026 21:1672,533611,731,987598,966,0003,063,0002,121,728