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 6, 2025 12:06Rajarshi BasuRajarshi BasuScore: 6,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 12:066,77979,848,25054,255,0002,009,0002,273,280
2Dec 6, 2025 12:066,78480,214,06154,297,0002,011,0002,531,328
3Dec 6, 2025 12:066,79282,992,59254,359,0002,013,0002,269,184
4Dec 6, 2025 12:066,94780,219,06656,647,0001,011,0002,387,968
5Dec 6, 2025 12:066,94782,095,83356,651,0001,011,0002,281,472
6Dec 6, 2025 12:067,08684,039,77156,824,0001,993,0002,289,664