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:24Yuriy LyfenkoYuriy LyfenkoScore: 4,735Success
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:244,71472,250,01536,116,0003,009,0002,285,568
2Mar 18, 2026 03:244,71462,548,86236,114,0003,009,0002,392,064
3Mar 18, 2026 03:244,71564,509,45336,125,0003,010,0002,301,952
4Mar 18, 2026 03:244,72864,691,15436,225,0003,018,0002,285,568
5Mar 18, 2026 03:244,73569,567,00936,275,0003,022,0002,285,568
6Mar 18, 2026 03:244,75968,458,33636,460,0003,038,0002,285,568
7Mar 18, 2026 03:244,85064,121,55139,251,0001,006,0002,285,568
8Mar 18, 2026 03:244,86567,544,62838,364,0002,019,0002,310,144
9Mar 18, 2026 03:244,87869,927,41538,467,0002,024,0002,457,600