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 listSep 29, 2026 00:28Karthik ReddyKarthik ReddyScore: 4,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 00:294,43647,168,38235,696,0001,130,0002,113,536
2Sep 29, 2026 00:294,44647,271,72135,785,0001,120,0002,113,536
3Sep 29, 2026 00:294,45847,411,24635,826,0001,179,0002,113,536
4Sep 29, 2026 00:294,47047,425,41536,076,0001,031,0002,113,536
5Sep 29, 2026 00:294,60248,566,09137,062,0001,138,0002,113,536
6Sep 29, 2026 00:294,60348,487,95837,073,0001,133,0002,113,536
7Sep 29, 2026 00:294,61848,676,72937,198,0001,138,0002,113,536
8Sep 29, 2026 00:294,62048,685,66037,223,0001,125,0002,113,536
9Sep 29, 2026 00:294,62148,719,78337,227,0001,129,0002,113,536