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 8, 2026 08:07caandocaandoScore: 8,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 08:077,75385,108,24363,346,0001,005,0002,519,040
2Mar 8, 2026 08:077,75987,165,64463,395,0001,006,0002,531,328
3Mar 8, 2026 08:327,77889,442,04964,558,00002,539,520
4Mar 8, 2026 08:327,77994,037,31663,561,0001,008,0002,281,472
5Mar 8, 2026 08:327,86885,825,78463,295,0002,009,0002,281,472
6Mar 8, 2026 08:077,93498,125,73663,854,0001,995,0002,269,184
7Mar 8, 2026 08:078,74299,111,58572,562,00002,519,040
8Mar 8, 2026 08:328,744102,055,94971,566,0001,007,0002,281,472
9Mar 8, 2026 08:328,74999,019,11472,620,00002,281,472
10Mar 8, 2026 08:328,75099,152,19972,622,00002,510,848
11Mar 8, 2026 08:078,75099,468,52972,627,00002,281,472
12Mar 8, 2026 08:078,92399,402,00872,057,0002,001,0002,359,296