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 listFeb 15, 2026 23:05wnwnScore: 9,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:058,03095,739,03359,584,0007,069,0002,469,888
2Feb 15, 2026 23:058,08988,940,40457,117,00010,020,0002,449,408
3Feb 15, 2026 23:058,11489,822,53361,319,0006,031,0002,314,240
4Feb 15, 2026 23:059,194100,369,80568,277,0008,032,0002,351,104
5Feb 15, 2026 23:059,21798,679,43470,459,0006,039,0002,465,792
6Feb 15, 2026 23:059,246110,652,50466,775,0009,966,0002,490,368
7Feb 15, 2026 23:059,249102,515,01169,788,0006,978,0002,314,240
8Feb 15, 2026 23:059,27999,974,21669,015,0008,001,0002,400,256
9Feb 15, 2026 23:059,28598,365,64271,060,0006,005,0002,453,504
10Feb 15, 2026 23:059,410101,084,60171,094,0007,009,0002,465,792
11Feb 15, 2026 23:059,438110,568,67968,296,00010,043,0002,510,848
12Feb 15, 2026 23:059,506107,213,24070,913,0007,990,0002,457,600