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 10, 2026 19:17Daniel MastalerzDaniel MastalerzScore: 8,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:178,23190,312,45666,309,0002,009,0002,326,528
2Feb 10, 2026 19:178,23292,786,26765,312,0003,014,0002,326,528
3Feb 10, 2026 19:178,23594,901,20064,332,0004,020,0002,326,528
4Feb 10, 2026 19:178,37689,489,41866,497,0003,022,0002,383,872
5Feb 10, 2026 19:178,39397,265,47066,630,0003,028,0002,322,432
6Feb 10, 2026 19:178,45293,601,48566,144,0004,008,0002,269,184