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 26, 2025 19:12hunaphuhunaphuScore: 3,419,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 19:123,372,04228,021,767,95013,469,720,00014,518,231,0002,273,280
2Dec 26, 2025 19:123,419,86828,424,260,96113,680,171,00014,704,735,0002,281,472
3Dec 26, 2025 19:123,543,04929,444,621,91813,640,574,00015,766,729,0002,273,280