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 listFeb 12, 2026 05:23olliecrowolliecrowScore: 5,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 05:235,49770,139,47143,596,0002,027,0002,404,352
2Feb 12, 2026 05:235,52081,588,73244,823,000996,0002,490,368
3Feb 12, 2026 05:235,64370,997,63144,842,0001,992,0002,400,256
4Feb 12, 2026 05:235,86974,733,93344,734,0003,976,0002,494,464
5Feb 12, 2026 05:235,94374,537,57248,323,0001,006,0002,457,600
6Feb 12, 2026 05:235,95477,884,58347,401,0002,017,0002,441,216
7Feb 12, 2026 05:235,95871,885,85948,444,0001,009,0002,334,720
8Feb 12, 2026 05:236,00478,383,38547,842,0001,993,0002,486,272
9Feb 12, 2026 05:236,03275,646,95647,062,0003,003,0002,355,200
10Feb 12, 2026 05:236,06877,441,90248,354,0002,014,0002,301,952
11Feb 12, 2026 05:236,07978,921,13549,445,0001,009,0002,437,120
12Feb 12, 2026 05:236,07973,329,84848,438,0002,018,0002,342,912