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 18:54Daniel MastalerzDaniel MastalerzScore: 6,790Success
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 18:546,76279,933,44352,115,0004,008,0002,281,472
2Feb 19, 2026 18:546,76684,052,90453,150,0003,008,0002,310,144
3Feb 19, 2026 18:536,77083,759,31752,177,0004,013,0002,310,144
4Feb 19, 2026 18:536,77380,004,34354,211,0002,007,0002,322,432
5Feb 19, 2026 18:536,79076,366,78552,335,0004,025,0002,306,048
6Feb 19, 2026 18:546,82788,677,04953,632,0003,035,0002,322,432
7Feb 19, 2026 18:546,89780,490,95153,227,0004,017,0002,301,952
8Feb 19, 2026 18:546,89884,341,69053,238,0004,018,0002,306,048
9Feb 19, 2026 18:546,91784,822,53153,381,0004,028,0002,306,048