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 listMar 29, 2026 20:45Danylo MocherniukDanylo MocherniukScore: 6,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 20:456,64176,710,58853,117,0002,004,0002,506,752
2Mar 29, 2026 20:456,66182,010,86053,279,0002,010,0002,293,760
3Mar 29, 2026 20:456,66977,790,72353,341,0002,012,0002,502,656
4Mar 29, 2026 20:456,68977,597,57054,510,0001,009,0002,293,760
5Mar 29, 2026 20:456,69879,595,58354,584,0001,010,0002,506,752
6Mar 29, 2026 20:456,70279,713,05855,623,00002,289,664
7Mar 29, 2026 20:456,72082,615,47954,781,000996,0002,322,432
8Mar 29, 2026 20:456,73082,703,45952,864,0002,992,0002,293,760
9Mar 29, 2026 20:456,75680,325,46154,076,0002,002,0002,293,760