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 listAug 27, 2026 05:49Victor MerckléVictor MerckléScore: 4,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:494,06242,775,12032,522,0001,194,0002,117,632stderr
2Aug 27, 2026 05:494,06242,136,10932,493,0001,223,0002,117,632stderr
3Aug 27, 2026 05:494,06942,076,84432,612,0001,166,0002,117,632stderr
4Aug 27, 2026 05:494,08342,295,64832,678,0001,216,0002,117,632stderr
5Aug 27, 2026 05:494,10543,095,69732,922,0001,153,0002,117,632stderr
6Aug 27, 2026 05:494,10642,488,74132,903,0001,183,0002,117,632stderr
7Aug 27, 2026 05:494,11443,067,52933,038,0001,112,0002,117,632stderr
8Aug 27, 2026 05:494,13842,741,67433,191,0001,160,0002,117,632stderr
9Aug 27, 2026 05:494,23251,730,21734,070,0001,063,0002,117,632stderr