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 14, 2026 17:49Elijah KinElijah KinScore: 79,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 17:4979,069681,878,256588,244,00068,028,0002,256,896
2Mar 14, 2026 17:4979,112686,291,820586,669,00069,960,0002,379,776
3Mar 14, 2026 17:4979,125682,660,214591,767,00064,974,0002,256,896
4Mar 14, 2026 17:4979,179683,604,813596,167,00061,017,0002,383,872
5Mar 14, 2026 17:4979,182691,084,426589,192,00068,022,0002,379,776
6Mar 14, 2026 17:4979,219687,486,330592,563,00064,952,0002,256,896
7Mar 14, 2026 17:4979,245684,348,808590,763,00066,973,0002,383,872
8Mar 14, 2026 17:4979,263684,014,583593,894,00063,988,0002,260,992
9Mar 14, 2026 17:4979,307686,745,321583,217,00075,027,0002,519,040