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 listNov 4, 2025 04:21Tejas G.Tejas G.Score: 7,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:217,14281,756,00157,273,0002,009,0002,371,584
2Nov 4, 2025 04:217,14482,395,15157,289,0002,010,0002,285,568
3Nov 4, 2025 04:217,14780,863,93558,313,0001,005,0002,285,568
4Nov 4, 2025 04:217,14881,869,76558,326,0001,005,0002,269,184
5Nov 4, 2025 04:217,15584,374,44158,378,0001,006,0002,273,280
6Nov 4, 2025 04:217,20885,603,94357,834,0001,994,0002,285,568
7Nov 4, 2025 04:217,20990,609,55658,841,000997,0002,269,184
8Nov 4, 2025 04:217,21182,843,70158,840,0001,014,0002,510,848
9Nov 4, 2025 04:217,21785,985,95057,903,0001,996,0002,285,568
10Nov 4, 2025 04:217,34584,602,63859,964,000999,0002,285,568
11Nov 4, 2025 04:217,34684,381,07558,973,0001,999,0002,285,568
12Nov 4, 2025 04:217,35085,918,27560,007,0001,000,0002,285,568