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 28, 2026 19:38Victor MerckléVictor MerckléScore: 5,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:395,16551,895,68541,857,0001,019,0002,117,632stderr
2Aug 28, 2026 19:395,17352,057,46241,915,0001,021,0002,117,632stderr
3Aug 28, 2026 19:395,17452,022,10141,933,0001,018,0002,117,632stderr
4Aug 28, 2026 19:395,19152,145,19342,073,0001,019,0002,117,632stderr
5Aug 28, 2026 19:395,19652,166,61942,106,0001,021,0002,117,632stderr
6Aug 28, 2026 19:395,19752,128,58342,123,0001,019,0002,117,632stderr
7Aug 28, 2026 19:395,22352,397,79042,334,0001,020,0002,117,632stderr
8Aug 28, 2026 19:395,25152,660,13142,570,0001,021,0002,117,632stderr
9Aug 28, 2026 19:395,29752,989,71242,947,0001,020,0002,117,632stderr