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 listJul 24, 2026 19:44Kevin HeaveyKevin HeaveyScore: 3,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 19:463,50245,389,49827,844,0001,229,0002,113,536
2Jul 24, 2026 19:463,51945,570,88928,163,0001,048,0002,113,536
3Jul 24, 2026 19:463,54745,930,28528,408,0001,037,0002,113,536
4Jul 24, 2026 19:463,68052,809,90429,453,0001,096,0002,113,536
5Jul 24, 2026 19:463,75547,655,20929,918,0001,256,0002,113,536
6Jul 24, 2026 19:463,81348,220,26930,434,0001,215,0002,113,536
7Jul 24, 2026 19:463,82848,228,03430,735,0001,040,0002,113,536
8Jul 24, 2026 19:463,83148,310,35230,723,0001,076,0002,113,536
9Jul 24, 2026 19:463,83948,403,57030,657,0001,208,0002,113,536