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 16, 2026 23:23Victor MerckléVictor MerckléScore: 34,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:2434,849299,202,805288,096,0001,154,0002,117,632stderr
2Sep 16, 2026 23:2434,937299,831,362288,913,0001,072,0002,117,632stderr
3Sep 16, 2026 23:2434,937299,865,884288,904,0001,076,0002,117,632stderr
4Sep 16, 2026 23:2434,950301,212,864289,013,0001,075,0002,117,632stderr
5Sep 16, 2026 23:2434,989300,310,381289,327,0001,088,0002,117,632stderr
6Sep 16, 2026 23:2435,004300,430,800289,398,0001,139,0002,117,632stderr
7Sep 16, 2026 23:2435,006300,401,595289,413,0001,140,0002,117,632stderr
8Sep 16, 2026 23:2435,033300,759,370289,760,0001,018,0002,117,632stderr
9Sep 16, 2026 23:2435,098301,252,462290,232,0001,088,0002,117,632stderr