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 5, 2026 12:49wnwnScore: 3,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 12:533,28135,712,74926,225,0001,009,0002,113,536
2Sep 5, 2026 12:533,28735,689,80326,255,0001,028,0002,113,536
3Sep 5, 2026 12:533,29235,773,89126,320,0001,005,0002,113,536
4Sep 5, 2026 12:533,29735,871,52926,335,0001,031,0002,113,536
5Sep 5, 2026 12:533,30135,857,70126,392,0001,007,0002,113,536
6Sep 5, 2026 12:533,31836,008,21026,510,0001,034,0002,113,536
7Sep 5, 2026 12:533,42036,835,27827,386,0001,002,0002,113,536
8Sep 5, 2026 12:533,45237,001,20327,653,0001,003,0002,113,536
9Sep 5, 2026 12:533,46037,145,76427,725,0001,001,0002,113,536