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 listApr 17, 2026 07:28Charles CabergsCharles CabergsScore: 22,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 07:2822,079209,941,173182,254,0001,001,0002,367,488
2Apr 17, 2026 07:2822,134206,854,209181,717,0001,996,0002,281,472
3Apr 17, 2026 07:2822,357216,898,466184,564,0001,003,0002,281,472
4Apr 17, 2026 07:2822,378211,405,331183,739,0001,997,0002,281,472
5Apr 17, 2026 07:2822,395210,114,472182,878,0002,998,0002,281,472
6Apr 17, 2026 07:2822,403207,567,399183,946,0001,999,0002,510,848
7Apr 17, 2026 07:2822,407212,356,012181,980,0003,999,0002,281,472
8Apr 17, 2026 07:2822,416207,994,606186,049,00002,281,472
9Apr 17, 2026 07:2822,416212,270,202185,053,0001,000,0002,281,472