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 19, 2026 23:25Daniel MastalerzDaniel MastalerzScore: 8,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:257,90493,284,76564,598,0001,009,0002,293,760
2Feb 19, 2026 23:257,90694,045,08465,622,00002,293,760
3Feb 19, 2026 23:257,91297,051,45463,678,0001,989,0002,269,184
4Feb 19, 2026 23:258,05291,371,13164,834,0001,994,0002,289,664
5Feb 19, 2026 23:258,05391,611,44065,832,0001,012,0002,289,664
6Feb 19, 2026 23:258,06793,370,04364,962,0001,998,0002,289,664