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 listAug 2, 2025 20:31Jack FrigaardJack FrigaardScore: 4,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:314,91967,250,51338,836,0001,991,0002,519,040
2Aug 2, 2025 20:314,91971,658,93337,838,0002,987,0002,453,504
3Aug 2, 2025 20:314,92170,548,96139,846,000996,0002,519,040
4Aug 2, 2025 20:314,94362,103,47939,024,0002,001,0002,519,040
5Aug 2, 2025 20:314,94864,473,48838,066,0003,005,0002,519,040
6Aug 2, 2025 20:314,95066,002,76039,078,0002,004,0002,519,040