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 listApr 13, 2026 11:22wnwnScore: 4,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:224,05764,806,66932,649,0001,020,0002,494,464
2Apr 13, 2026 11:224,07363,193,47331,822,0001,988,0002,494,464
3Apr 13, 2026 11:224,07762,475,29431,848,0001,990,0002,277,376
4Apr 13, 2026 11:224,07758,533,17431,851,0001,990,0002,277,376
5Apr 13, 2026 11:224,07864,680,47331,859,0001,991,0002,277,376
6Apr 13, 2026 11:224,09761,313,22132,003,0002,000,0002,277,376
7Apr 13, 2026 11:224,09956,335,81932,018,0002,001,0002,490,368
8Apr 13, 2026 11:224,15060,055,94533,430,0001,013,0002,277,376
9Apr 13, 2026 11:224,23358,407,53233,124,0002,007,0002,277,376