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 14, 2026 17:23matsuoka-601matsuoka-601Score: 4,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 17:234,84063,062,19137,158,0003,012,0002,506,752
2Mar 14, 2026 17:234,84863,404,44337,222,0003,018,0002,289,664
3Mar 14, 2026 17:234,86062,781,49837,316,0003,025,0002,506,752
4Mar 14, 2026 17:234,86965,338,35739,403,0001,010,0002,506,752
5Mar 14, 2026 17:234,88465,593,15938,510,0002,026,0002,506,752
6Mar 14, 2026 17:234,88569,757,37738,520,0002,027,0002,289,664
7Mar 14, 2026 17:234,91769,710,96138,821,0001,990,0002,289,664
8Mar 14, 2026 17:234,91866,575,33137,835,0002,986,0002,289,664
9Mar 14, 2026 17:234,95464,783,33439,115,0002,005,0002,494,464