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 listApr 28, 2026 08:57TudyMTudyMScore: 36,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:5836,521320,339,518302,130,0001,000,0002,375,680
2Apr 28, 2026 08:5836,558323,348,129302,435,0001,001,0002,387,968
3Apr 28, 2026 08:5836,561326,182,053302,463,0001,001,0002,375,680
4Apr 28, 2026 08:5836,565320,598,538302,494,0001,001,0002,318,336
5Apr 28, 2026 08:5836,571322,303,861302,544,0001,001,0002,383,872
6Apr 28, 2026 08:5836,576323,144,680302,588,0001,001,0002,387,968
7Apr 28, 2026 08:5836,576322,029,851301,588,0001,997,0002,387,968
8Apr 28, 2026 08:5836,598325,831,549301,773,0001,998,0002,306,048
9Apr 28, 2026 08:5836,599323,122,847301,781,0001,998,0002,318,336