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 3, 2026 17:20Josu San MartinJosu San MartinScore: 12,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:2112,397112,391,309100,871,0002,025,0002,113,536
2Jul 3, 2026 17:2112,417112,488,420102,056,0001,011,0002,113,536
3Jul 3, 2026 17:2112,495113,144,518101,698,0002,016,0002,113,536
4Jul 3, 2026 17:2112,540113,470,928103,076,0001,013,0002,113,536
5Jul 3, 2026 17:2112,591113,996,684103,490,0001,018,0002,113,536
6Jul 3, 2026 17:2112,617114,139,486103,706,0001,019,0002,113,536
7Jul 3, 2026 17:2112,628114,202,237103,805,0001,010,0002,113,536
8Jul 3, 2026 17:2112,673114,644,288104,176,0001,013,0002,113,536
9Jul 3, 2026 17:2112,688114,829,925103,283,0002,034,0002,113,536