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 listJul 28, 2025 01:39Marco BarboneMarco BarboneScore: 136,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 01:39134,0541,138,529,5681,110,652,0001,999,0002,277,376
2Jul 28, 2025 01:39136,6901,158,181,9101,132,529,0001,999,0002,273,280
3Jul 28, 2025 01:39154,2601,311,076,6151,278,361,0001,999,0002,519,040