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 03:21Yuriy LyfenkoYuriy LyfenkoScore: 4,736Success
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 03:214,72464,855,35536,191,0003,015,0002,371,584
2Mar 18, 2026 03:214,72462,220,14036,196,0003,016,0002,379,776
3Mar 18, 2026 03:214,72562,514,84337,209,0002,011,0002,293,760
4Mar 18, 2026 03:214,72962,673,79539,252,00002,404,352
5Mar 18, 2026 03:214,73668,840,93036,285,0003,023,0002,285,568
6Mar 18, 2026 03:214,75364,839,60436,412,0003,034,0002,285,568
7Mar 18, 2026 03:214,85262,677,89039,265,0001,006,0002,301,952
8Mar 18, 2026 03:214,85966,017,08938,313,0002,016,0002,293,760
9Mar 18, 2026 03:214,88768,112,67238,533,0002,028,0002,277,376