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 2, 2026 21:36javivallejojavivallejoScore: 58,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 21:3657,937514,400,927478,874,0001,999,0002,510,848
2Feb 2, 2026 21:3658,007507,644,563480,457,0001,000,0002,383,872
3Feb 2, 2026 21:3658,089504,075,969482,139,00002,519,040