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 listJun 19, 2026 15:55A_ShamanA_ShamanScore: 78,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 15:5578,445660,172,217591,813,00059,283,0002,113,536
2Jun 19, 2026 15:5578,475660,305,116592,321,00059,029,0002,113,536
3Jun 19, 2026 15:5578,509660,979,988591,960,00059,672,0002,113,536
4Jun 19, 2026 15:5578,537660,852,250591,259,00060,601,0002,113,536
5Jun 19, 2026 15:5578,568661,290,262592,473,00059,647,0002,113,536
6Jun 19, 2026 15:5578,581661,351,303591,890,00060,334,0002,113,536
7Jun 19, 2026 15:5578,614661,516,629592,139,00060,364,0002,113,536
8Jun 19, 2026 15:5578,669661,973,084592,526,00060,433,0002,113,536
9Jun 19, 2026 15:5579,228666,720,497596,528,00061,071,0002,113,536