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 listSep 24, 2026 05:20wnwnScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:203,35836,626,66126,842,0001,032,0002,113,536
2Sep 24, 2026 05:203,38036,868,86727,031,0001,028,0002,113,536
3Sep 24, 2026 05:203,38036,858,57127,013,0001,041,0002,113,536
4Sep 24, 2026 05:203,38436,922,45527,092,0001,003,0002,113,536
5Sep 24, 2026 05:203,39236,919,31627,117,0001,041,0002,113,536
6Sep 24, 2026 05:203,51137,796,20328,100,0001,048,0002,113,536
7Sep 24, 2026 05:203,53638,057,92528,322,0001,031,0002,113,536
8Sep 24, 2026 05:203,55138,060,29528,432,0001,043,0002,113,536
9Sep 24, 2026 05:203,61339,416,82328,986,0001,006,0002,113,536