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 listAug 23, 2026 18:21Victor MerckléVictor MerckléScore: 3,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:223,87340,544,59131,101,0001,045,0002,117,632stderr
2Aug 23, 2026 18:223,89040,631,28731,267,0001,023,0002,117,632stderr
3Aug 23, 2026 18:223,90640,804,75631,342,0001,085,0002,117,632stderr
4Aug 23, 2026 18:223,91940,880,11831,502,0001,026,0002,117,632stderr
5Aug 23, 2026 18:223,92240,886,04931,535,0001,018,0002,117,632stderr
6Aug 23, 2026 18:223,92741,604,97131,453,0001,149,0002,117,632stderr
7Aug 23, 2026 18:223,95848,104,41131,681,0001,176,0002,117,632stderr
8Aug 23, 2026 18:224,02241,762,60032,324,0001,060,0002,117,632stderr
9Aug 23, 2026 18:224,11142,539,36433,100,0001,028,0002,117,632stderr