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 listJan 1, 2026 20:06Josu San MartinJosu San MartinScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:066,02078,305,52046,969,0002,998,0002,297,856
2Jan 1, 2026 20:066,06780,317,79447,331,0003,021,0002,338,816
3Jan 1, 2026 20:066,10078,438,18446,583,0004,050,0002,457,600
4Jan 1, 2026 20:066,33676,833,68451,579,0001,011,0002,494,464
5Jan 1, 2026 20:066,36078,754,84851,793,000996,0002,506,752
6Jan 1, 2026 20:066,36177,160,98448,810,0003,984,0002,371,584
7Jan 1, 2026 20:066,36181,922,51050,805,0001,992,0002,297,856
8Jan 1, 2026 20:066,36676,359,07746,858,0005,981,0002,392,064
9Jan 1, 2026 20:066,40775,821,08951,175,0002,006,0002,310,144
10Jan 1, 2026 20:066,40886,508,25250,177,0003,010,0002,379,776
11Jan 1, 2026 20:066,41781,275,41948,233,0005,024,0002,437,120
12Jan 1, 2026 20:066,43581,542,69250,387,0003,023,0002,433,024