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 listJan 3, 2026 16:37Carlos MGCarlos MGScore: 80,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 16:3780,667698,390,801668,535,000999,0002,347,008
2Jan 3, 2026 16:3780,669697,134,898666,557,0002,998,0002,347,008
3Jan 3, 2026 16:3780,686696,117,894667,692,0001,999,0002,375,680