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 listFeb 15, 2026 22:16wnwnScore: 9,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:168,43092,647,09862,969,0006,996,0002,498,560
2Feb 15, 2026 22:168,57993,449,23062,177,0009,025,0002,371,584
3Feb 15, 2026 22:168,66391,569,65164,912,0006,990,0002,465,792
4Feb 15, 2026 22:169,569106,611,49969,372,00010,053,0002,281,472
5Feb 15, 2026 22:169,588104,571,15771,519,0008,058,0002,371,584
6Feb 15, 2026 22:169,611104,481,49771,796,0007,977,0002,469,888
7Feb 15, 2026 22:169,632108,417,00071,950,0007,994,0002,465,792
8Feb 15, 2026 22:169,634100,392,95071,970,0007,996,0002,375,680
9Feb 15, 2026 22:169,678108,550,64072,298,0008,033,0002,473,984
10Feb 15, 2026 22:169,734109,617,78071,819,0008,977,0002,392,064
11Feb 15, 2026 22:169,753108,773,24469,960,00010,993,0002,457,600
12Feb 15, 2026 22:1610,043106,172,36774,319,0009,038,0002,387,968