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 21, 2026 14:08Daniel MastalerzDaniel MastalerzScore: 5,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 14:085,57268,885,98442,224,0004,021,0002,269,184
2Feb 21, 2026 14:085,57670,316,96043,263,0003,018,0002,314,240
3Feb 21, 2026 14:085,59274,450,41843,384,0003,026,0002,269,184
4Feb 21, 2026 14:085,60074,348,58443,446,0003,031,0002,326,528
5Feb 21, 2026 14:085,60169,236,90042,443,0004,042,0002,301,952
6Feb 21, 2026 14:085,61882,704,14344,602,0002,027,0002,523,136
7Feb 21, 2026 14:085,62572,979,01445,670,0001,014,0002,523,136
8Feb 21, 2026 14:085,63976,407,63342,822,0003,983,0002,301,952
9Feb 21, 2026 14:085,64077,274,52243,823,0002,987,0002,514,944
10Feb 21, 2026 14:085,67372,753,27143,076,0004,007,0002,260,992
11Feb 21, 2026 14:085,69270,351,57145,234,0002,010,0002,265,088
12Feb 21, 2026 14:085,69769,351,75645,273,0002,012,0002,318,336