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 listApr 26, 2026 16:03wnwnScore: 3,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:053,40043,958,61327,214,0001,007,0002,490,368
2Apr 26, 2026 16:053,42942,111,59927,447,0001,016,0002,330,624
3Apr 26, 2026 16:053,43146,026,99027,467,0001,017,0002,490,368
4Apr 26, 2026 16:053,43443,608,74027,487,0001,018,0002,330,624
5Apr 26, 2026 16:053,44346,022,20227,560,0001,020,0002,330,624
6Apr 26, 2026 16:053,45046,509,74327,615,0001,022,0002,486,272
7Apr 26, 2026 16:053,50449,267,87527,082,0002,006,0002,490,368
8Apr 26, 2026 16:053,52545,031,52628,251,0001,008,0002,490,368
9Apr 26, 2026 16:053,54846,113,06029,452,00002,486,272