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 14, 2026 15:16boop34boop34Score: 51,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 15:1751,119433,953,013423,255,0001,035,0002,113,536
2Jul 14, 2026 15:1751,121434,083,085423,264,0001,045,0002,113,536
3Jul 14, 2026 15:1751,123434,040,585423,217,0001,107,0002,113,536
4Jul 14, 2026 15:1751,128434,183,408423,248,0001,116,0002,113,536
5Jul 14, 2026 15:1751,136434,763,324423,318,0001,112,0002,113,536
6Jul 14, 2026 15:1751,148434,921,172423,532,0001,004,0002,113,536
7Jul 14, 2026 15:1751,149434,711,519423,504,0001,034,0002,113,536
8Jul 14, 2026 15:1751,163434,832,483423,595,0001,064,0002,113,536
9Jul 14, 2026 15:1751,338436,520,711425,022,0001,086,0002,113,536