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 21, 2026 20:42A_ShamanA_ShamanScore: 46,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 20:4246,635396,360,417314,076,00072,998,0002,113,536
2Jun 21, 2026 20:4246,685396,590,800314,232,00073,259,0002,113,536
3Jun 21, 2026 20:4246,725396,966,301314,290,00073,531,0002,113,536
4Jun 21, 2026 20:4246,726396,872,171314,419,00073,409,0002,113,536
5Jun 21, 2026 20:4246,839397,917,394314,307,00074,461,0002,113,536
6Jun 21, 2026 20:4246,844397,996,954314,440,00074,368,0002,113,536
7Jun 21, 2026 20:4248,174408,999,103318,028,00081,818,0002,113,536
8Jun 21, 2026 20:4248,302410,023,995318,053,00082,859,0002,113,536
9Jun 21, 2026 20:4248,335410,311,360317,893,00083,294,0002,113,536