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 14, 2026 16:48Oleg SkinderevOleg SkinderevScore: 65,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 16:4865,010564,745,532537,585,0001,998,0002,293,760
2Apr 14, 2026 16:4865,011570,174,878538,594,000999,0002,281,472
3Apr 14, 2026 16:4865,020564,716,235537,665,0001,998,0002,523,136
4Apr 14, 2026 16:4865,023564,978,193537,692,0001,998,0002,289,664
5Apr 14, 2026 16:4865,024567,530,188538,702,000999,0002,289,664
6Apr 14, 2026 16:4865,025564,548,212537,706,0001,998,0002,289,664
7Apr 14, 2026 16:4865,028563,099,211537,736,0001,999,0002,273,280
8Apr 14, 2026 16:4865,030562,768,503537,748,0001,999,0002,289,664
9Apr 14, 2026 16:4865,033565,886,788538,772,000999,0002,281,472