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 21, 2026 11:16olliecrowolliecrowScore: 5,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:145,81375,906,55545,232,0003,015,0002,297,856
2Mar 21, 2026 11:165,85977,218,32047,620,0001,013,0002,301,952
3Mar 21, 2026 12:235,88071,557,27344,817,0003,983,0002,306,048
4Mar 21, 2026 11:145,88173,179,26045,823,0002,988,0002,355,200
5Mar 21, 2026 12:235,88171,292,33243,833,0004,981,0002,514,944
6Mar 21, 2026 11:165,89274,894,76844,910,0003,992,0002,433,024
7Mar 21, 2026 11:145,96577,383,07146,536,0002,970,0002,363,392
8Mar 21, 2026 12:235,97373,682,64347,552,0002,023,0002,449,408
9Mar 21, 2026 11:166,02776,252,14947,027,0003,001,0002,306,048