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 8, 2026 10:54Daniel MastalerzDaniel MastalerzScore: 13,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 10:5413,382135,961,748107,070,0004,002,0002,322,432
2Feb 8, 2026 10:5413,386134,013,776103,099,0008,007,0002,400,256
3Feb 8, 2026 10:5413,391138,302,650107,139,0004,005,0002,318,336
4Feb 8, 2026 10:5413,391135,648,764106,139,0005,006,0002,396,160
5Feb 8, 2026 10:5413,398135,658,990105,190,0006,010,0002,408,448
6Feb 8, 2026 10:5413,403133,318,374104,232,0007,015,0002,306,048
7Feb 8, 2026 10:5413,404135,761,060104,298,0006,953,0002,404,352
8Feb 8, 2026 10:5413,407130,203,794105,262,0006,014,0002,363,392
9Feb 8, 2026 10:5413,435137,503,898107,496,0004,018,0002,400,256