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 9, 2026 20:34Daniel MastalerzDaniel MastalerzScore: 11,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:3411,019118,580,74087,438,0004,020,0002,310,144
2Feb 9, 2026 20:3411,020121,917,15083,422,0008,040,0002,375,680
3Feb 9, 2026 20:3411,049115,715,57383,731,0007,974,0002,265,088
4Feb 9, 2026 20:3411,204113,907,53986,998,0005,999,0002,265,088
5Feb 9, 2026 20:3411,225118,073,02986,157,0007,012,0002,318,336
6Feb 9, 2026 20:3411,257117,869,06686,478,0006,958,0002,273,280