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 18, 2026 01:29Yuriy LyfenkoYuriy LyfenkoScore: 6,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 01:256,12779,048,84149,857,000997,0002,297,856
2Mar 18, 2026 01:256,12980,594,40649,874,000997,0002,297,856
3Mar 18, 2026 01:256,12978,608,68148,879,0001,995,0002,301,952
4Mar 18, 2026 01:256,13173,934,12749,891,000997,0002,310,144
5Mar 18, 2026 01:256,13276,273,26547,902,0002,993,0002,293,760
6Mar 18, 2026 01:256,13476,862,28548,917,0001,996,0002,383,872
7Mar 18, 2026 01:296,13484,828,01547,918,0002,994,0002,306,048
8Mar 18, 2026 01:296,13782,136,22447,938,0002,996,0002,285,568
9Mar 18, 2026 01:256,14678,669,89448,015,0003,000,0002,285,568
10Mar 18, 2026 01:256,14777,689,30748,018,0003,001,0002,306,048
11Mar 18, 2026 01:256,15179,249,75550,051,0001,001,0002,285,568
12Mar 18, 2026 01:296,16777,084,15748,175,0003,010,0002,301,952