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 11, 2026 15:46caandocaandoScore: 4,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 15:464,65370,845,53737,606,0001,016,0002,285,568
2Mar 11, 2026 15:464,66068,898,76137,661,0001,017,0002,285,568
3Mar 11, 2026 15:464,67972,554,83136,844,0001,991,0002,482,176
4Mar 11, 2026 15:464,68165,010,12935,865,0002,988,0002,486,272
5Mar 11, 2026 15:464,68463,338,64036,882,0001,993,0002,482,176
6Mar 11, 2026 15:464,68866,708,10136,918,0001,995,0002,285,568