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 listMay 18, 2026 01:30avoidcatenjoyersavoidcatenjoyersScore: 85,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:3085,053715,601,836647,253,00058,688,0002,113,536
2May 18, 2026 01:3085,136718,834,878648,208,00058,428,0002,113,536
3May 18, 2026 01:3085,152719,183,735647,315,00059,447,0002,113,536
4May 18, 2026 01:3085,202718,851,294647,886,00059,292,0002,113,536
5May 18, 2026 01:3085,204717,853,953647,204,00059,990,0002,113,536
6May 18, 2026 01:3085,215718,458,471648,285,00059,004,0002,113,536
7May 18, 2026 01:3085,237719,297,472647,211,00060,259,0002,113,536
8May 18, 2026 01:3085,249716,937,889648,077,00059,491,0002,113,536
9May 18, 2026 01:3085,263719,673,523648,597,00059,091,0002,113,536