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 listDec 11, 2025 15:29Bernard TeoBernard TeoScore: 6,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:296,22585,475,89650,654,0001,013,0002,273,280
2Dec 11, 2025 15:296,22782,606,28851,681,00002,273,280
3Dec 11, 2025 15:296,24277,857,67549,817,0001,992,0002,400,256
4Dec 11, 2025 15:296,24275,958,91650,815,000996,0002,273,280
5Dec 11, 2025 15:296,24277,257,85249,819,0001,992,0002,273,280
6Dec 11, 2025 15:296,24285,240,44249,819,0001,992,0002,392,064
7Dec 11, 2025 15:296,24482,087,31651,828,00002,273,280
8Dec 11, 2025 15:296,24474,230,12649,829,0001,993,0002,273,280
9Dec 11, 2025 15:296,24480,371,69649,833,0001,993,0002,396,160
10Dec 11, 2025 15:296,25376,437,57150,900,000998,0002,273,280
11Dec 11, 2025 15:296,25476,898,94749,914,0001,996,0002,273,280
12Dec 11, 2025 15:296,26272,211,71950,977,000999,0002,392,064