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 listJul 1, 2026 18:29TragmatiSTragmatiSScore: 364,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 18:29364,3193,033,974,3382,954,802,00069,050,0002,113,536
2Jul 1, 2026 18:29364,5473,035,541,1042,956,692,00069,053,0002,113,536
3Jul 1, 2026 18:29364,5503,035,502,5682,956,729,00069,036,0002,113,536
4Jul 1, 2026 18:29364,7133,036,696,9142,957,064,00070,055,0002,113,536
5Jul 1, 2026 18:29364,7943,037,350,8972,956,734,00071,059,0002,113,536
6Jul 1, 2026 18:29364,9283,040,289,7942,957,848,00071,057,0002,113,536
7Jul 1, 2026 18:29365,0273,039,717,5582,958,675,00071,051,0002,113,536
8Jul 1, 2026 18:29365,1393,040,263,8822,960,423,00070,234,0002,113,536
9Jul 1, 2026 18:29369,8413,079,269,2342,999,636,00070,052,0002,113,536