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 29, 2025 14:56Josu San MartinJosu San MartinScore: 28,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:5628,664264,894,505235,911,0001,999,0002,281,472
2Dec 29, 2025 14:5628,668258,667,952235,949,0001,999,0002,400,256
3Dec 29, 2025 14:5628,683260,287,841236,067,0002,000,0002,392,064
4Dec 29, 2025 14:5628,700259,114,683237,206,0001,000,0002,510,848
5Dec 29, 2025 14:5628,705263,485,036238,248,00002,281,472
6Dec 29, 2025 14:5628,729266,472,563238,451,00002,273,280
7Dec 29, 2025 14:5628,733263,094,955237,481,0001,002,0002,387,968
8Dec 29, 2025 14:5628,737268,583,051237,511,0001,002,0002,281,472
9Dec 29, 2025 14:5628,767269,438,371236,764,0001,998,0002,281,472