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 listJan 31, 2026 18:47Izaac MammadovIzaac MammadovScore: 368,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 18:47368,2283,084,181,8432,985,335,00070,960,0002,289,664
2Jan 31, 2026 18:47368,3833,085,238,4972,999,604,00057,973,0002,289,664
3Jan 31, 2026 18:47368,8693,084,493,5712,983,647,00077,964,0002,281,472
4Jan 31, 2026 18:47368,9443,092,031,6532,997,273,00064,962,0002,281,472
5Jan 31, 2026 18:47368,9563,086,084,5093,000,369,00061,966,0002,281,472
6Jan 31, 2026 18:47370,0533,098,985,9412,994,478,00076,960,0002,281,472
7Jan 31, 2026 18:47373,2473,128,464,7153,048,970,00048,983,0002,289,664
8Jan 31, 2026 18:47374,3033,133,857,4353,051,741,00054,977,0002,281,472
9Jan 31, 2026 18:47376,4453,150,932,4923,062,527,00061,970,0002,281,472