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 listMar 23, 2026 20:01Elijah KinElijah KinScore: 47,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 20:0147,463417,686,767391,947,0001,999,0002,523,136
2Mar 23, 2026 20:0147,485418,140,273393,122,0001,000,0002,387,968
3Mar 23, 2026 20:0147,491416,806,529394,175,00002,265,088
4Mar 23, 2026 20:0147,492422,893,713393,187,0001,000,0002,260,992
5Mar 23, 2026 20:0147,493421,298,821393,195,0001,000,0002,383,872
6Mar 23, 2026 20:0147,501421,917,553394,258,00002,265,088
7Mar 23, 2026 20:0147,506421,632,689393,298,0001,000,0002,523,136
8Mar 23, 2026 20:0147,516428,005,585394,382,00002,523,136
9Mar 23, 2026 20:0147,542422,747,293392,600,0001,997,0002,383,872