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 listApr 29, 2026 13:08TudyMTudyMScore: 52,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:0852,263450,837,530431,792,0001,999,0002,396,160
2Apr 29, 2026 13:0852,310448,734,981433,176,0001,000,0002,306,048
3Apr 29, 2026 13:0852,312450,747,329432,195,0002,000,0002,371,584
4Apr 29, 2026 13:0852,345453,932,533433,464,0001,001,0002,379,776
5Apr 29, 2026 13:0852,367455,970,118432,655,0001,998,0002,375,680
6Apr 29, 2026 13:0852,437461,458,069434,234,0001,000,0002,375,680
7Apr 29, 2026 13:0852,449455,822,628433,326,0002,001,0002,473,984
8Apr 29, 2026 13:0852,508459,056,476433,818,0001,999,0002,375,680
9Apr 29, 2026 13:0852,746454,300,725435,793,0001,999,0002,322,432