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 listMar 20, 2026 00:11olliecrowolliecrowScore: 5,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 00:085,76071,208,76844,821,0002,988,0002,269,184
2Mar 20, 2026 00:085,78172,643,08945,987,0001,999,0002,383,872
3Mar 20, 2026 00:115,80872,818,39145,196,0003,013,0002,437,120
4Mar 20, 2026 00:115,82169,390,90645,295,0003,019,0002,416,640
5Mar 20, 2026 00:115,94675,501,54548,348,0001,007,0002,523,136
6Mar 20, 2026 00:085,95874,117,64345,417,0004,037,0002,469,888