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 1, 2026 08:54kairveekairveeScore: 59,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 08:5458,990517,835,237488,618,000999,0002,523,136
2Jan 1, 2026 08:5458,992514,034,120487,637,0001,998,0002,379,776
3Jan 1, 2026 08:5458,993514,919,615487,640,0001,998,0002,375,680
4Jan 1, 2026 08:5458,993516,385,115487,644,0001,998,0002,379,776
5Jan 1, 2026 08:5459,000518,947,260487,701,0001,998,0002,523,136
6Jan 1, 2026 08:5459,002515,439,628488,719,000999,0002,387,968
7Jan 1, 2026 08:5459,008520,092,368487,764,0001,999,0002,375,680
8Jan 1, 2026 08:5459,020518,970,637487,870,0001,999,0002,387,968
9Jan 1, 2026 08:5459,034513,937,764488,982,000999,0002,519,040