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 listJun 30, 2026 14:50Saif Al-HarthiSaif Al-HarthiScore: 11,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:5011,897108,191,56897,619,0001,131,0002,117,632
2Jun 30, 2026 14:5011,899108,223,70997,651,0001,117,0002,117,632
3Jun 30, 2026 14:5011,901108,187,89097,664,0001,122,0002,117,632
4Jun 30, 2026 14:5011,902108,259,00597,655,0001,134,0002,117,632
5Jun 30, 2026 14:5011,902108,232,17497,645,0001,147,0002,117,632
6Jun 30, 2026 14:5011,905108,233,41497,700,0001,117,0002,117,632
7Jun 30, 2026 14:5011,908108,262,83697,689,0001,150,0002,117,632
8Jun 30, 2026 14:5011,915108,281,04297,775,0001,121,0002,117,632
9Jun 30, 2026 14:5012,062109,431,88898,983,0001,136,0002,117,632